Ant Colony Optimization and the minimum spanning tree problem
نویسندگان
چکیده
منابع مشابه
Ant Colony Optimization and the Minimum Spanning Tree Problem
Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem. In contrast to many successful applications, the theoretical found...
متن کاملVariable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present two new approaches to solve this problem heuristically following the concepts of ant colony optimization (ACO) and variable neighborhood search (VNS). The...
متن کاملSolving the Minimum Label Spanning Tree Problem by Ant Colony Optimization
The Minimum Label Spanning Tree Problem is a well known combinatorial optimization problem, having applications in telecommunication network design and data compression. The problem is NP-hard and cannot be approximated within a constant factor. In this work we present the application of ant colony optimization to this problem. Different pheromone models and construction mechanisms are introduc...
متن کاملAn Ant Colony Optimization Approach to the Degree-Constrained Minimum Spanning Tree Problem
This paper presents the design of two Ant Colony Optimization (ACO) approaches and their improved variants on the degree-constrained minimum spanning tree (d-MST) problem. The first approach, which we call p-ACO, uses the vertices of the construction graph as solution components, and is motivated by the well-known Prim’s algorithm for constructing MST. The second approach, known as k-ACO, uses ...
متن کاملMAGISTERARBEIT An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem
This master thesis presents an ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem, a NP-hard combinatorial optimisation problem with various application fields, e.g. when considering certain aspects of quality in communication network design. The algorithm is extended with local optimisation in terms of a variable neighbourhood descent algorithm based on fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.02.012